Maximum Exact Satisfiability: NP-completeness Proofs and Exact Algorithms
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for Exact Satisfiability Problems
This thesis presents exact means for solving a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (Xsat) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. While developing exact algorithms to solve the problems, we gain new insights into their structure and mutual similarities and differences...
متن کاملNew algorithms for Exact Satisfiability
The Exact Satisfiability problem is to determine if a CNFformula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact 3-Satisfiability running in time O(20.2325n) and O(20.1379n), respectively. The previously best al...
متن کاملAlgorithms for Max Hamming Exact Satisfiability
We here study Max Hamming XSAT, ie, the problem of finding two XSAT models at maximum Hamming distance. By using a recent XSAT solver as an auxiliary function, an O(1.911^n) time algorithm can be constructed, where n is the number of variables. This upper time bound can be further improved to O(1.8348^n) by introducing a new kind of branching, more directly suited for finding models at maximum ...
متن کاملParameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
We study the complexity of several parameterizations for max k-set cover. Given a family of subsets S = {S1, . . . , Sm} over a set of elements X = {x1, . . . , xn} and an integer p, max k-set cover consists of finding a set T of at most k subsets covering at least p elements. This problem, when parameterized by k, is W[2]-hard. Here, we settle the multiparameterized complexity of max k-set cov...
متن کاملMaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a Boolean formula. A branch and bound algorithm based on the Davis-Putnam-Logemann-Loveland procedure (DPLL) is one of the most competitive exact algorithms for solving max-SAT. In this paper, we propose an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2004
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v11i19.21844